Traffic Grooming on Ring networks

In traffic grooming several low rate traffic (requests) can be combined into a high bandwidth wavelength such that at any network link the combined traffic rate is no more than the available wavelength bandwidth. When more than one requests are combined to share wavelength bandwidth Add-Drop Multiplexors (ADM) are needed for opto-electronic conversion at nodes where traffic is added or dropped from the wavelength, such that, traffic on same wavelength may share ADM. The grooming problem aim to minimize the number of ADM and wavelength requirement on the network. For general instances the problem is NP-hard even on simple network topology such as Path and Rings [12]. For ring networks with all-to-all instances the problem have been optimally solved for some granularity (grooming ratio) [1, 2, 3, 11, 19, 18]. We consider general instances on ring networks with grooming ratio 2 and propose grooming algorithm that is experimentally evaluated for performance which compares favourably with previously known algorithms for the problem. The proposed algorithm can groom instance of both, unidirectional and bidirectional rings. Furthermore, we describe how to efficiently adapt the algorithm to rings with arbitrary granularity.